Branch-and-Cut for the Split Delivery Vehicle Routing Problem with Time Windows
نویسندگان
چکیده
منابع مشابه
Branch-and-Cut for the Split Delivery Vehicle Routing Problem with Time Windows
The Split Delivery Vehicle Routing Problem with Time Windows (SDVRPTW) is a notoriously hard combinatorial optimization problem. First, it is hard to find a useful compact Mixed-Integer Programming (MIP) formulation for the SDVRPTW. Standard modeling approach either suffer from inherent symmetries (MIPs with a vehicle index) or cannot exactly capture all aspects of feasibility. Due to the possi...
متن کاملBranch-and-price-and-cut for the Split-collection Vehicle Routing Problem with Time Windows and Linear Weight-related Cost
This paper addresses a new vehicle routing problem that simultaneously involves time windows, split collection and linear weightrelated cost, which is a generalization of the split delivery vehicle routing problem with time windows (SDVRPTW). This problem consists of determining least-cost vehicle routes to serve a set of customers while respecting the restrictions of vehicle capacity and time ...
متن کاملCompetitive Vehicle Routing Problem with Time Windows and Stochastic Demands
The competitive vehicle routing problem is one of the important issues in transportation area. In this paper a new method for competitive VRP with time windows and stochastic demand is introduced. In the presented method a three time bounds are given and the probability of arrival time between each time bound is assumed to be uniform. The demands of each customer are different in each time wind...
متن کاملBranch and price for the vehicle routing problem with discrete split deliveries and time windows
The Discrete Split Delivery Vehicle Routing Problem with Time Windows (DSDVRPTW) consists of designing the optimal set of routes to serve, at least cost, a given set of customers while respecting constraints on vehicles’ capacity and customer time windows. The delivery request of a customer is discrete since it consists of several items that cannot be split further. The problem belongs to the c...
متن کاملA branch-price-and-cut for the vehicle routing problem with time windows and multiple deliverymen
We address a variant of the vehicle routing problem with time windows, which includes the decision of how many deliverymen should be assigned to each vehicle in addition to the usual routing and scheduling decisions. This variant is relevant in cases in which many requests should be delivered in busy urban areas on the same day, and the service times at customers are long in relation to vehicle...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transportation Science
سال: 2019
ISSN: 0041-1655,1526-5447
DOI: 10.1287/trsc.2018.0825